A Fast , Cache - Aware Algorithmfor the Calculation of Radiological PathsExploiting Subword

نویسندگان

  • Mark Christiaens
  • Bjorn De Sutter
  • Koen De Bosschere
  • Jan Van Campenhout
  • Ignace Lemahieu
چکیده

The calculation of radiological paths is the most important part in statistical positron emission tomography image reconstruction algorithms. We present a new, faster algorithm which replaces Siddon's. Further code transformations on this algorithm prove to be beneecial in a Maximum Likelihood-Expectation Maximization reconstruction algorithm and the result is perfectly suitable for an implementation that exploits the VISual instruction set from Sun or other modern architectural extensions providing subword parallelism. The nal speed-up achieved with this new algorithm and its subword parallel implementation is 13. Though smaller data formats are used in subword parallelism, the resulting images are as good as the original ones.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Colored Invariants in Predicate/transition Nets

The duality properties of Peti Nets (PN) are exploiled in order to apply an algorithmfor the calculation of colored S-invaiants of Predicate Transition nets (Pr/T nets) to the calculation of the colored T-invariants.

متن کامل

Hardware and Software Mechanisms for Reducing Load Latency

As processor demands quickly outpace memory, the performance of load instructions becomes an increasingly critical component to good system performance. This thesis contributes four novel load latency reduction techniques, each targeting a di erent component of load latency: address calculation, data cache access, address translation, and data cache misses. The contributed techniques are as fol...

متن کامل

Some properties of a class of polyhedral semigroups based upon the subword reversing method

In this paper a certain class of polyhedral semigroups which has a presentation $$ is examined‎. ‎The completeness of the presentation and solvability of word problem of this class of semigroups is determined‎. ‎Moreover the combinatorial distance between two words is determined‎.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998